A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
نویسندگان
چکیده
منابع مشابه
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
We propose a polynomial-time-delay polynomial-space algorithm to enumerate all efficient extreme solutions of a multi-criteria minimum-cost spanning tree problem, while only the bicriteria case was studied in the literature. The algorithm is based on the reverse search framework due to Avis & Fukuda. We also show that the same technique can be applied to the multi-criteria version of the minimu...
متن کاملA Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motif that is not properly contained in any larger motifs with the same location lists. Although the enumeration problem for maximal motifs with wild cards has been studied in (Parida et al., CPM’01), (Pisanti et a...
متن کاملAn efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motif that is not properly contained in any larger motifs with the same location lists. Although the enumeration problem for maximal motifs with wild cards has been studied in (Parida et al., CPM’01), (Pisanti et a...
متن کاملA Polynomial Space Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence
In this paper, we consider the problem of finding all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motifs that is not properly contained in larger motifs with the same location lists. The enumeration problem for maximal motifs with wild cards has been introduced in (Parida et al., SODA’00, CPM’01), and has been stud...
متن کاملA Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems
We propose a new infeasible primal-dual predictor-corrector interior-point method (IPM) with adaptive criteria for constraint reduction. The algorithm is a modification of one with no constraint reduction, due to Potra and Sheng (2006). Our algorithm can be applied when the data matrices are block diagonal. It thus solves as special cases any optimization problem that is linear, convex quadrati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2011
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2010.10.008